When is argumentation deductive?

نویسندگان

چکیده

This paper discusses and compares various answers to the question when argumentation is deductive. includes an answer questions defeasible whether a subclass of deductive or it distinct form argumentation. It concluded that as conceived by Philosophers like Pollock Rescher formalised in ASPIC+ framework systems Defeasible Logic Programming, are semantically different categories. For this reason, purely syntactic base logic approaches formal unsuitable for characterising distinction.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Argumentation within deductive reasoning

Deductive reasoning is an area related to argumentation where machine-based techniques, notably theorem proving, can contribute substantially to the formation of arguments. However, making use of the functionality of theorem provers for this issue is associated with a number of difficulties and, as we will demonstrate, requires considerable effort for obtaining reasonable results. Aiming at the...

متن کامل

Selective Revision by Deductive Argumentation

The success postulate of classic belief revision theory demands that after revising some beliefs with by information the new information is believed. However, this form of prioritized belief revision is not apt under many circumstances. Research in non-prioritized belief revision investigates forms of belief revision where success is not a desirable property. Herein, selective revision uses a t...

متن کامل

Rigorous Deductive Argumentation for Socially Relevant Issues

Rigorous Deductive Argumentation for Socially Relevant Issues Dustin Wehr Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2015 The most important problems for society are describable only in vague terms, dependent on subjective positions, and missing highly relevant data. This thesis is intended to revive and further develop the view that giving non-trivial, r...

متن کامل

Encoding deductive argumentation in quantified Boolean formulae

There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arguments. A common assumption for logic-based argumentation is that an argument is a pair 〈Φ, α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics provi...

متن کامل

When every $P$-flat ideal is flat

In this paper‎, ‎we study the class of rings in which every $P$-flat‎ ‎ideal is flat and which will be called $PFF$-rings‎. ‎In particular‎, ‎Von Neumann regular rings‎, ‎hereditary rings‎, ‎semi-hereditary ring‎, ‎PID and arithmetical rings are examples of $PFF$-rings‎. ‎In the context domain‎, ‎this notion coincide with‎ ‎Pr"{u}fer domain‎. ‎We provide necessary and sufficient conditions for‎...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Non-Classical Logics

سال: 2023

ISSN: ['1958-5780', '1166-3081']

DOI: https://doi.org/10.1080/11663081.2023.2246862